Weakly Distributive Domains
نویسندگان
چکیده
In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This accomplishes the first of a possible, two-step process in solving the problem raised in [1, 2]: whether the category of stable bifinite domains of Amadio-Droste-Göbel [1, 6] is the largest cartesian closed full subcategory within the category of ω-algebraic meet-cpos with stable functions. This paper presents results on the second step, which is to show that for any ω-algebraic meet-cpo D satisfying axioms M and I to be contained in a cartesian closed full sub-category using ω-algebraic meet-cpos with stable functions, it must not violate MI . We introduce a new class of domains called weakly distributive domains and show that for these domains to be in a cartesian closed category using ω-algebraic meet-cpos, property MI must not be violated. We further demonstrate that principally distributive domains (those for which each principle ideal is distributive) form a proper subclass of weakly distributive domains, and Birkhoff’s M3 and N5 [5] are weakly distributive (but non-distributive). We introduce also the notion of meet-generators in constructing stable functions and show that if an ω-algebraic meet-cpo D contains an infinite number of meet-generators, then [D → D] fails I. However, the original problem of Amadio and Curien remains open.
منابع مشابه
A duality between fuzzy domains and strongly completely distributive $L$-ordered sets
The aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. All values aretaken in a fixed frame $L$. A definition of (strongly) completelydistributive $L$-ordered sets is introduced. The main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $L$-ordereds...
متن کاملWeak Distributivity implying Distributivity
Let B be a complete Boolean algebra. We show that if λ is an infinite cardinal and B is weakly (λ, ω)-distributive, then B is (λ, 2)-distributive. Using a similar argument, we show that if κ is a weakly compact cardinal such that B is weakly (2, κ)distributive and B is (α, 2)-distributive for each α < κ, then B is (κ, 2)-distributive.
متن کاملWeakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid
Distributive supermatroids generalize matroids to partially ordered sets. Completing earlier work of Barnabei, Nicoletti and Pezzoli we characterize the lattice of flats of a distributive supermatroid. For the prominent special case of a polymatroid the description of the flat lattice is particularly simple. Large portions of the proofs reduce to properties of weakly submodular rank functions. ...
متن کاملVon Neumann’s Problem and Large Cardinals
It is a well known problem of Von Neumann whether the countable chain condition and weak distributivity of a complete Boolean algebra imply that it carries a strictly positive probability measure. It was shown recently by Balcar–Jech–Pazák and Velickovic that it is consistent with ZFC, modulo the consistency of a supercompact cardinal, that every ccc weakly distributive complete Boolean algebra...
متن کاملCovering in the Lattice of Subuniverses of a Finite Distributive Lattice
The covering relation in the lattice of subuniverses of a finite distributive lattice is characterized in terms of how new elements in a covering sublattice fit with the sublattice covered. In general, although the lattice of subuniverses of a finite distributive lattice will not be modular, nevertheless we are able to show that certain instances of Dedekind’s Transposition Principle still hold...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007